H-monotonically Computable Real Numbers
نویسندگان
چکیده
Xizhong Zheng∗1,2, Robert Rettinger3, and George Barmpalias4 1 Theoretische Informatik, BTU Cottbus, 03044 Cottbus, Germany. [email protected] 2 Dept. of Comput. Sci., Jiangsu University, Zhenjiang 212013, China 3 Theoretische Informatik II, FernUniversität Hagen, 58084 Hagen, Germany. [email protected] 4 School of Mathematics University of Leeds, Leeds LS2 9JT, U.K. [email protected]
منابع مشابه
On the Monotonic Computability of Semi-computable Real Numbers
Let h : N → Q be a computable function. A real number x is h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges to x in such a way that the ratios of the approximation errors are bounded by h. In this paper we discuss the h-monotonic computability of semi-computable real numbers which are limits of monotone computable sequences ...
متن کاملMonotonically Computable Real Numbers
A real number x is called k-monotonically computable (k-mc), for constant k > 0, if there is a computable sequence (xn)n∈N of rational numbers which converges to x such that the convergence is k-monotonic in the sense that k · |x−xn| ≥ |x−xm| for any m > n and x is monotonically computable (mc) if it is k-mc for some k > 0. x is weakly computable if there is a computable sequence (xs)s∈N of rat...
متن کاملComputable Approximations of Reals: An Information-Theoretic Analysis
How fast can one approximate a real by a computable sequence of rationals? We show that the answer to this question depends very much on the information content in the nite pre xes of the binary expansion of the real. Computable reals, whose binary expansions have a very low information content, can be approximated (very fast) with a computable convergence rate. Random reals, whose binary expan...
متن کاملOn the Subrecursive Computability of Several Famous Constants
For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number α is called Fcomputable if there exist one-argument functions f , g and h in F such that for any n in N the distance between the rational number f(n) − g(n) over h(n) + 1 and the number α is not greater than the reciprocal of n + 1. Most concrete real numbers p...
متن کاملDivergence bounded computable real numbers
A real x is called h-bounded computable, for some function h : N → N, if there is a computable sequence (xs) of rational numbers which converges to x such that, for any n ∈ N, at most h(n) non-overlapping pairs of its members are separated by a distance larger than 2−n. In this paper we discuss properties of h-bounded computable reals for various functions h. We will show a simple sufficient co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 51 شماره
صفحات -
تاریخ انتشار 2005